A Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation

Evolutionary algorithms have been frequently applied to constrained continuous optimisation problems. We carry out feature based comparisons of different types of evolutionary algorithms such as evolution strategies, differential evolution and particle swarm optimisation for constrained continuous optimisation. In our study, we examine how sets of constraints influence the difficulty of obtaining close to optimal solutions. Using a multi-objective approach, we evolve constrained continuous problems having a set of linear and/or quadratic constraints where the different evolutionary approaches show a significant difference in performance. Afterwards, we discuss the features of the constraints that exhibit a difference in performance of the different evolutionary approaches under consideration.Comment: 16 Pagesm 2 Figure

A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem

Understanding the behaviour of well-known algorithms for classical NP-hard optimisation problems is still a difficult task. With this paper, we contribute to this research direction and carry out a feature based comparison of local search and the well-known Christofides approximation algorithm for the Traveling Salesperson Problem. We use an evolutionary algorithm approach to construct easy and hard instances for the Christofides algorithm, where we measure hardness in terms of approximation ratio. Our results point out important features and lead to hard and easy instances for this famous algorithm. Furthermore, our cross-comparison gives new insights on the complementary benefits of the different approaches.Samadhi Nallaperuma, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf Mersmann, Heike Trautmannhttp://www.sigevo.org/foga-2013

Using landscape topology to compare continuous metaheuristics: a framework and case study on EDAs and ridge structure

In this paper we extend a previously proposed randomized landscape generator in combination with a comparative experimental methodology to study the behavior of continuous metaheuristic optimization algorithms. In particular, we generate twodimensional landscapes with parameterized, linear ridge structure, and perform pairwise comparisons of algorithms to gain insight into what kind of problems are easy and difficult for one algorithm instance relative to another.We apply thismethodology to investigate the specific issue of explicit dependency modeling in simple continuous estimation of distribution algorithms. Experimental results reveal specific examples of landscapes (with certain identifiable features) where dependency modeling is useful, harmful, or has little impact on mean algorithm performance. Heat maps are used to compare algorithm performance over a large number of landscape instances and algorithm trials. Finally, we perform ameta-search in the landscape parameter space to find landscapes which maximize the performance between algorithms. The results are related to some previous intuition about the behavior of these algorithms, but at the same time lead to new insights into the relationship between dependency modeling in EDAs and the structure of the problem landscape. The landscape generator and overall methodology are quite general and extendable and can be used to examine specific features of other algorithms

Analyzing the BBOB Results by Means of Benchmarking Concepts

We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the "best" one? and the second one is: which algorithm should I use for my real-world problem? Both are connected and neither is easy to answer. We present a theoretical framework for designing and analyzing the raw data of such benchmark experiments. This represents a first step in answering the aforementioned questions. The 2009 and 2010 BBOB benchmark results are analyzed by means of this framework and we derive insight regarding the answers to the two questions. Furthermore, we discuss how to properly aggregate rankings from algorithm evaluations on individual problems into a consensus, its theoretical background and which common pitfalls should be avoided. Finally, we address the grouping of test problems into sets with similar optimizer rankings and investigate whether these are reflected by already proposed test problem characteristics, finding that this is not always the case.FWN – Publicaties zonder aanstelling Universiteit Leide

Feature-based diversity optimization for problem instance classification

Parallel Problem Solving from Nature – PPSN XIVUnderstanding the behaviour of heuristic search methods is a challenge. This even holds for simple local search methods such as 2-OPT for the Traveling Salesperson problem. In this paper, we present a general framework that is able to construct a diverse set of instances that are hard or easy for a given search heuristic. Such a diverse set is obtained by using an evolutionary algorithm for constructing hard or easy instances that are diverse with respect to different features of the underlying problem. Examining the constructed instance sets, we show that many combinations of two or three features give a good classification of the TSP instances in terms of whether they are hard to be solved by 2-OPT.Wanru Gao, Samadhi Nallaperuma, and Frank Neuman

Measurement of the Analyzing Power in p⃗d→(pp)n\vec{p}d \to (pp)n \\with a Fast Forward 1S0^1S_0--Diproton

A measurement of the analyzing power $A_y$ of the $\vec{p}d \to (pp) + n$ reaction was carried out at beam energies of 0.5 and 0.8 GeV by detection of a fast forward proton pair of small excitation energy $E_{pp} < 3$ MeV. The kinematically complete experiment made use of the ANKE spectrometer at the internal beam of COSY and a deuterium cluster--jet target. For the first time the $S$--wave dominance in the fast diproton is experimentally demonstrated in this reaction. While at $T_p=0.8$ GeV the measured analyzing power $A_y$ vanishes, it reaches almost unity at $T_p=0.5$ GeV for neutrons scattered at $\theta_n^{c.m.}=167^\circ$. The results are compared with a model taking into account one--nucleon exchange, single scattering and $\Delta$ (1232) excitation in the intermediate state. The model describes fairly well the unpolarized cross section obtained earlier by us and the analyzing power at 0.8 GeV, it fails to reproduce the angular dependence of $A_y$ at 0.5 GeV.Comment: 4 pages, 4 figures, 1 tabl

Determination of Deuteron Beam Polarizations at COSY

The vector and tensor polarizations of a deuteron beam have been measured using elastic deuteron-carbon scattering at 75.6 MeV and deuteron-proton scattering at 270 MeV. After acceleration to 1170 MeV inside the COSY ring, the polarizations of the deuterons were checked by studying a variety of nuclear reactions using a cluster target at the ANKE magnet spectrometer placed at an internal target position of the storage ring. All these measurements were consistent with the absence of depolarization during acceleration and provide a number of secondary standards that can be used in subsequent experiments at the facility.Comment: 12 pages, 13 figure

The pd --> ^3He eta pi0 reaction at T_p = 1450 MeV

The cross section for the pd --> ^3He eta pi0 reaction has been measured at a beam energy of 1450 MeV using the WASA detector at the CELSIUS storage ring and detecting one ^3He and four photons from the decays of the two photons. The data indicate that the production mechanism involves the formation of the Delta(1232) isobar. Although the beam energy does not allow the full peak of this resonance to be seen, the invariant masses of all three pairs of final state particles are well reproduced by a phase space Monte Carlo simulation weighted with the p-wave factor of the square of the pi^0 momentum in the ^3Hepi^0 system.Comment: 10 pages, 5 figure

Production of eta and 3pi mesons in the pd->3HeX reaction at 1360 and 1450 MeV

The cross sections of the pd -> 3He eta, pd -> 3He pi0 pi0 pi0 and pd -> 3He pi+ pi- pi0 reactions have been measured at beam kinetic energies T_p= 1360 MeV and T_p= 1450 MeV using the CELSIUS/WASA detector setup. At both energies, the differential cross section dsigma/dOmega of the eta meson in the pd -> 3He eta reaction shows a strong forward-backward asymmetry in the CMS. The ratio between the pd -> 3He pi+ pi- pi0 and the pd -> 3He pi0 pi0 pi0 cross sections has been analysed in terms of isospin amplitudes. The reconstructed invariant mass distributions of the pi-pi, 3He-pi and 3He-2pi systems provide hints on the role of nucleon resonances in the 3pi production process.Comment: Shorter version accepted to EPJA 10 pages 14 figure